Counting modular matrices with specified euclidean norm
نویسندگان
چکیده
منابع مشابه
Norm Euclidean Quaternionic Orders
We determine the norm Euclidean orders in a positive definite quaternion algebra over Q. Lagrange (1770) proved the four square theorem via Euler’s four square identity and a descent argument. Hurwitz [4] gave a quaternionic proof using the order Λ(2) with Z-basis: 1, i, j, 1 2 (1 + i + j + k). Here i = j = −1 and ij = −ji = k, the standard basis of the quaternions. The key property of Λ(2) is ...
متن کاملOn Euclidean norm approximations
Euclidean norm calculations arise frequently in scientific and engineering applications. Several approximations for this norm with differing complexity and accuracy have been proposed in the literature. Earlier approaches [1, 2, 3] were based on minimizing the maximum error. Recently, Seol and Cheun [4] proposed an approximation based on minimizing the average error. In this paper, we first exa...
متن کاملCounting Curves with Modular Forms
We consider the type IIA string compactified on the Calabi-Yau space given by a degree 12 hypersurface in the weighted projective space P(1,1,2,2,6). We express the prepotential of the low-energy effective supergravity theory in terms of a set of functions that transform covariantly under PSL(2,ZZ) modular transformations. These functions are then determined by monodromy properties, by singular...
متن کاملOn Euclidean distance matrices
If A is a real symmetric matrix and P is an orthogonal projection onto a hyperplane, then we derive a formula for the Moore-Penrose inverse of PAP . As an application, we obtain a formula for the MoorePenrose inverse of a Euclidean distance matrix (EDM) which generalizes formulae for the inverse of a EDM in the literature. To an invertible spherical EDM, we associate a Laplacian matrix (which w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1988
ISSN: 0097-3165
DOI: 10.1016/0097-3165(88)90048-9